Towards GPU-Based Common-Sense Reasoning: Using Fast Subgraph Matching
نویسندگان
چکیده
منابع مشابه
Detecting false captioning using common-sense reasoning
Detecting manipulated images has become an important problem in many domains (including medical imaging, forensics, journalism and scientific publication) largely due to the recent success of image synthesis techniques and the accessibility of image editing software. Many previous signal-processing techniques are concerned about finding forgery through simple transformation (e.g. resizing, rota...
متن کامل280 Common Sense Reasoning
Even with powerful numerical computers, exploring complex dynamical systems requires significant human effort and judgment to prepare simulations and to interpret numerical results. This paper describes one-aspect of a computer program, KAM, that can autonomously prepare numerical simulations, and can automatically generate high-level, qualitative interpretations of the quantitative results. Gi...
متن کاملTowards More Flexible and Common-Sense Reasoning About Beliefs
Some important research problems within reasoning about beliefs are how to deal with incomplete, inaccurate or uncertain beliefs, when to ascribe beliefs and how to make reasoning about beliefs more common-sensical. We present two systems that attack such problems. The first, called CaseMent, uses case-based reasoning to reason about beliefs. It appears that using cases as opposed to roles has ...
متن کاملFast Subgraph Matching on Large Graphs using Graphics Processors
Subgraph matching is the task of finding all matches of a query graph in a large data graph, which is known as an NP-complete problem. Many algorithms are proposed to solve this problem using CPUs. In recent years, Graphics Processing Units (GPUs) have been adopted to accelerate fundamental graph operations such as breadthfirst search and shortest path, owing to their parallelism and high data ...
متن کاملA Weighted Common Subgraph Matching Algorithm
We propose a weighted common subgraph (WCS) matching algorithm to find the most similar subgraphs in two labeled weighted graphs. WCS matching, as a natural generalization of the equal-sized graph matching or subgraph matching, finds wide applications in many computer vision and machine learning tasks. In this paper, the WCS matching is first formulated as a combinatorial optimization problem o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cognitive Computation
سال: 2016
ISSN: 1866-9956,1866-9964
DOI: 10.1007/s12559-016-9418-4